A Constraint Solver for Flexible Protein Models
نویسندگان
چکیده
This paper proposes the formalization and implementation of a novel class of constraints aimed at modeling problems related to placement of multi-body systems in the 3-dimensional space. Each multi-body is a system composed of body elements, connected by joint relationships and constrained by geometric properties. The emphasis of this investigation is the use of multi-body systems to model native conformations of protein structures—where each body represents an entity of the protein (e.g., an amino acid, a small peptide) and the geometric constraints are related to the spatial properties of the composing atoms. The paper explores the use of the proposed class of constraints to support a variety of different structural analysis of proteins, such as loop modeling and structure prediction. The declarative nature of a constraint-based encoding provides elaboration tolerance and the ability to make use of any additional knowledge in the analysis studies. The filtering capabilities of the proposed constraints also allow to control the number of representative solutions that are withdrawn from the conformational space of the protein, by means of criteria driven by uniform distribution sampling principles. In this scenario it is possible to select the desired degree of precision and/or number of solutions. The filtering component automatically excludes configurations that violate the spatial and geometric properties of the composing multi-body system. The paper illustrates the implementation of a constraint solver based on the multi-body perspective and its empirical evaluation on protein structure analysis problems.
منابع مشابه
A new non oriented models for calculating the efficiency of decision-making units in the presence of flexible variables
In assessing the relative efficiency of decision-maker units by classical Data Envelopment Analysis (DEA) models, the status of the data is determined from the input or output points of views. In real issues, there are some data whose statuses are debatable. Some decision making units consider them as input to achieve higher efficiency while some other decision making units consider them ...
متن کاملSimulation of Strap-On Boosters Separation in the Atmosphere
A numerical dynamic-aerodynamic interface for simulating the separation dynamics of constrained strap-on boosters jettisoned in the atmosphere is presented. A 6-DOF multi body dynamic solver ،using Constraint Force Equation Methodology is coupled with a numerical time dependent Euler flow solver. An automatic dynamic mesh updating procedure is employed using smoothing and l...
متن کاملSolution Strategies for Multi-domain Constraint Logic Programs
We integrate a logic programming language into Meta-S, a flexible and extendable constraint solver cooperation system, by treating resolution as constraint solver. This new approach easily yields a CLP language with support for solver cooperation. Applying the strategy definition framework of Meta-S we define classical search strategies and more sophisticated ones, that allow an efficient evalu...
متن کاملImplementation of Resource Constraints in ILOG SCHEDULE: A Library for the Development of Constraint-Based Scheduling Systems1
It has been argued that the use of constraint-based techniques and tools enables the implementation of precise, flexible, efficient and extensible scheduling systems: precise and flexible as the system can take into account any constraint expressible in the constraint language; efficient inasmuch as highly optimized constraint propagation procedures are now available; extensible as the consider...
متن کاملOverview of the Monadic Constraint Programming Framework
A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. The Monadic Constraint Programming framework gives a monadic def...
متن کاملUsing ATL to define advanced and flexible constraint model transformations
Transforming constraint models is an important task in recent constraint programming systems. User-understandable models are defined during the modeling phase but rewriting or tuning them is mandatory to get solving-efficient models. We propose a new architecture allowing to define bridges between any (modeling or solver) languages and to implement model optimizations. This architecture follows...
متن کامل